翻訳と辞書 Words near each other ・ Stabiliser (food) ・ Stability ・ Stability (learning theory) ・ Stability (probability) ・ Stability (short story) ・ Stability 2008 ・ Stability and Growth Pact ・ Stability and support operations ・ Stability conditions ・ Stability constant ・ Stability constants of complexes ・ Stability criterion ・ Stability derivatives ・ Stability group ・ Stability Model ・ Stability of Boolean networks ・ Stability of the Solar System ・ Stability Pact ・ Stability Pact for South Eastern Europe ・ Stability postulate ・ Stability radius ・ Stability spectrum ・ Stability testing ・ Stability theory ・ Stability–instability paradox ・ Stabilization (architecture) ・ Stabilization (medicine) ・ Stabilization (warfare) ・ Stabilization Act of 1942 ・ Stabilization clause Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Stability of Boolean networks ： ウィキペディア英語版 Stability of Boolean networks The stability of Boolean networks depends on the connections of their nodes. A Boolean network can exhibit stable, critical or chaotic behavior. This phenomenon is governed by a critical value of the average number of connections of nodes ($K\_$), and can be characterized by the Hamming distance as distance measure. In the unstable regime, the distance between two initially close states on average grows exponentially in time, while in the stable regime it decreases exponentially. In the critical regime, the Hamming distance is small compared with the number of nodes ($N$) in the network. In the case of $N-K$ Boolean networks, the network is * stable if & * critical if & $K=K\_$, * unstable if & $K>K\_$. The state of a given node $n\_$ is updated according to its truth table, whose outputs are randomly populated. $p\_$ denotes the probability of assigning an off output to a given series of input signals. If $p\_=p=const.$ for every node, the transition between the stable and chaotic range depends on $p$. The critical value of the average number of connections is $K\_=1/()$. If $K$ is not constant, and there is no correlation between the in-degrees and out-degrees, the conditions of stability is determined by $\backslash langle\; K^\backslash rangle$ The network is * stable if & * critical if & $\backslash langle\; K^\backslash rangle\; =K\_$, * unstable if & $\backslash langle\; K^\backslash rangle\; >K\_$. The conditions of stability are the same in the case of networks with scale-free topology, where the in-and out-degree distribution is a power-law distribution: $P(K)\; \backslash propto\; K^$, and $\backslash langle\; K^\; \backslash rangle=\backslash langle\; K^\; \backslash rangle$, since every out-link from a node is an in-link to another. Sensitivity shows the probability that the output of the Boolean function of a given node changes if its input changes. For random Boolean networks, $q\_=2p\_(1-p\_)$. In the general case, stability of the network is governed by the largest eigenvalue $\backslash lambda\_$ of matrix $Q$, where $Q\_=q\_A\_$, and $A$ is the adjacency matrix of the network. The network is * stable if & , * critical if & $\backslash lambda\_=1$, * unstable if & $\backslash lambda\_>1$. == References == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Stability of Boolean networks」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.